reachability tree
英 [riːtʃəˈbɪlɪti triː]
美 [ˌritʃəˈbɪlɪti triː]
网络 可达树; 可达性树; 可到达树
双语例句
- Reachability Tree Method and Its Application to Fault Diagnosis for Digital Circuits
可达树分析法及其在测试中的应用 - This work find a reachability tree method is used to solve diagnosis fault of digital circuits.
并研究了可达树分析法在数字电路故障测试中的应用。 - On the basis of reachability tree of Petri nets, boundedness, liveness and deadlock can be analyzed.
基于可达树的性能分析通过构造Petri网模型的可达树对其有界性、活性和死锁等性能指标做出了分析； - The model is validated by reachability tree and state matrix equations of Petri Net, and the validation result is that the model can be reachable.
同时，本文运用Petri网系统的可达树方法和状态矩阵方程的方法对模型进行了可达性验证，经验证该模型是安全可达的。 - High Level Petri Nets with marking variables is defined and it is shown that for this class of nets it is possible to construct efficiently the reachability tree.
本文定义了具有变量标识的高级Petri网并给出了构造该类网的可达树的算法。 - It discusses the approach of setting up workflow model based on these methods. With the object oriented timed Petri net, it shows the workflow model of business process in a manufacturing enterprise, analyzes the liveness of the Petri net by means of the reachability tree.
最后运用面向对象赋时Petri网建立了某制造企业业务流程的工作流模型，并运用可达树分析方法分析了网模型的活性。 - On the basis of reachability tree and net structure, a new analysis method for the dynamic deadlock test was advanced, and the algorithm was given in this paper.
本文在可达树和网结构的基础上，提出了一种分析与检测动态死锁的新方法，并给出了相应的算法。 - This paper proposes a Petri net model, presents a method to describe cryptographic protocol, and analyses the security based on this model in the RSA algorithm by using reachability tree.
本文提出用Petri网表示网络安全协议的方法描述现在普遍运行的RSA密码体系，并且对Petri的模型进行可达性分析从而验证了RSA的安全性。 - It makes use of the reachability tree to analyze the correctness, safety, fairness, reachability and liveliness of the Petri nets model of security electronic payment.
根据可达树分析了电子支付协议Petri网模型的正确性、安全性、公平性、可达性和活性。 - The Application of Equivalent Marking for Reducing the Scale of the Reachability Tree is Pr/ T Net System
等价标识在谓词/变迁网系统可达树规模缩减中的应用 - But the model of Petri net is complex in structure and its reachability tree's states space explodes when it describes a complex system. It is difficult to carry out the performance analysis and synthesis.
但是当实际系统较复杂时，Petri网模型结构复杂、不直观、可达树状态空间爆炸、不易于进行性能分析和控制综合。 - By using of the characters of safe Petri nets, a place invariant generation algorithm which uses the reachability tree of safe Petri nets and complete graph of mth order with self-loop is presented.
利用安全Petri网的特点，提出一种由安全Petri网可达树和带自环的m阶完全图来计算位置不变式的生成算法。 - The reachability tree is an important tool to analyze the properties of Petri Net.
可达树是Petri网性能分析的重要工具之一。 - Petri net is a kind of good tool to describe concurrent and asynchronous system, there are many methods to analyze Petri net, such as reachability graph, reachability tree, incidence matrix and so on. However, its correctness can be proved by mathematics method.
Petri网是一个描述异步并发的图形工具，具有可达树、可达图、关联矩阵等多种分析方法，并且可以通过数学方法来证明其正确性； - The reachability tree is established based on system's Petri nets model, so all the possible failure sequences of the system can be got. By calculating the probabilities of all the failure sequences, the dynamic reliability indexes of the system is obtained.
以系统Petri网模型为基础构造可达树，基于可达树得到系统所有可能的失效序列，给出了失效序列事件发生概率的计算方法，通过计算失效序列的发生概率求解系统动态可靠性指标。 - But the exponential explosion of the reachability set of High Level Petri Nets is a major obstacle encountered in implementing efficiently algorithms to construe the reachability tree.
高级Petri网可达集空间随着网的复杂性而指数性增长是计算可达树问题中的一个主要难点。 - The tree-chain structure of the reachability tree is beneficial to expanding various analysis algorithms of Petri net.
所生成的可达树的树链结构形式，利于展开Petri网的各种分析算法。 - Labeled reachability tree of Petri nets
Petri网的标注可达树 - It is well known that deciding reachability of bounded Petri nets with its reachability tree is easy.
众所周知，对于有界Petri网，通过构造其可达性树或可达标识图来判定其可达性是容易的。 - In addition, other articles propose that reachability of Petri nets can be studied with its coverability tree, but the unbounded quantity symbol "w" in it bring the information losing during unbounded Petri nets running so that decision of its reachability can not be achieved.
另外，有些文献提出通过构造Petri网的可达树或可覆盖树来分析其可达性，但其中无界量符号ω的引入导致了无界Petri网运行过程中的信息丢失，使其可达性无法得到判定。 - In this paper, we decrease the information losing during unbounded Petri nets running by finding an improvement of reachability tree, and finally propose an algorithm for reachability decision of any Petri nets including unbounded Petri nets by making use of its improved reachability tree.
本文通过寻求一个可达性树的适当改良而令无界Petri网运行过程中的信息丢失减小，并利用这个改良的可达性树给出一个任意Petri网（包括无界Petri网）的可达性判定方法。 - Then Stochastic Petri Nets is applied to modeling of a complicated hydraulic system. On the basis of the Petri Nets model, the dynamic characteristics of the system are analyzed and the reachability tree is established.
基于随机Petri网理论，论文完成了某复杂液压系统的动态可靠性建模，建立液压系统的可达树模型，并对液压系统的运行特性作出分析。 - In this paper, a Web Services composition model based on model driven architecture is established. Using Petri Nets for its modeling, and using reachability tree nature of Petri Nets validates the model boundedness, accessibility, activity and integrity.
本文构建了一种基于模型驱动的Web服务组合模型，采用Petri网对其建模，并利用Petri网的可达树性质验证了模型的有界性、可达性、活性和完整性。